Universal Composability: usecases
See Universal Composability
Zero-knowledge
How to Use SNARKs in Universally Composable Protocols (2015)
Ahmed Kosba et.al.
efficient SNARK-lifting transformations that allow us to transform zk-SNARKs to zeroknowledge proofs with simulation sound extractability, such that they could be adopted in UC-secure protocols
To optimize SNARK-lifting transformations and attain concrete efficiency, we investigated “SNARK-friendly cryptographic primitives”
Practical UC-Secure Delegatable Credentials with Attributes and Their Application to Blockchain
the first hierarchical (or delegatable) anonymous credential system that is practical
a concrete instantiation using a recent pairing-based signature scheme by Groth
an implementation of our scheme in the context of transaction authentication for blockchain
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts(2015)
(cited 449)
Ahmed Kosba, Andrew Miller, Elaine Shi, Zikai Wen, Charalampos Papamanthou
Hawk: a decentralized smart contract system that does not store financial transactions in the clear on the blockchain
A Hawk programmer can write a private smart contract in an intuitive manner without having to implement cryptography, and our compiler automatically generates an efficient cryptographic protocol where contractual parties interact with the blockchain, using cryptographic primitives such as zero-knowledge proofs
SNARKs
State channel
see State channel: UC Model
Layer1
How to Use Bitcoin to Design Fair Protocols (2014)
by Iddo Bento, Ranjit Kumaresan
"coins" model
used in Sprites, Perun
Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016)
Rafael Pass and Elaine Shi CornellTech, Cornell, Initiative for CryptoCurrency and Contracts (IC3)
Provable Security for Cryptocurrencies (2016)
A.Miller Ph.D thesis
"scratch-off puzzles" :a generalization of the Bitcoin “mining” algorithm
The blockchain functionality: a general-purpose model of a cryptocurrency in UC. We use this model to express a wide range of applications, including transparent “smart contracts”
Hawk
Bitcoin as a Transaction Ledger: A Composable Treatment(2018)
Christian Badertscher, Ueli Maurer, Daniel Tschudi and Vassilis Zikas
Weeaker model of the above Fair and Robust Multi-Party Computation using a Global Transaction Ledger
Model
Bitcoin as a semi-synchronous protocol:
The protocol can proceed in rounds — enabled by having access to a global synchronization clock $ G_{clock}
but is not aware of the actual delay of the network
Each round is divided into two mini-rounds, where each mini-round corresponds to a clock tick.
updating mini-round: fetch messages from the network to obtain messages sent previous rounds
working mini-round: solving the puzzle and multicasting solutions
cited in Sprites paper
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability
Ouroboros
Others
Fair and Robust Multi-Party Computation using a Global Transaction Ledger
Aggelos Kiayias(the University of Edinburgh, IOHK), Hong-Sheng Zhou, and Vassilis Zikas.
sMPC, UC style
MPC protocol where not only fairness is guaranteed (via compensation) but additionally the protocol is guaranteed to deliver output to the parties that get engaged
Universally Composable Accumulators (2018)
Foteini Baldimtsi, Ran Canetti, Sophia Yakoubov (Boston University)
ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement
Bernardo David, Rafael Dowsley, Mario Larangeira (IOHK)